Computation in Dynamically Bounded Asymmetric Systems
نویسندگان
چکیده
منابع مشابه
Computation in Dynamically Bounded Asymmetric Systems
Previous explanations of computations performed by recurrent networks have focused on symmetrically connected saturating neurons and their convergence toward attractors. Here we analyze the behavior of asymmetrical connected networks of linear threshold neurons, whose positive response is unbounded. We show that, for a wide range of parameters, this asymmetry brings interesting and computationa...
متن کاملHow to Model Bounded Computation in Long-Lived Systems
In most interesting cases, the security of cryptographic protocols relies on the assumption that adversarial entities have limited computational power, and it is generally accepted that security degrades progressively over time. However, some cryptographic services (e.g., timestamping services or digital archives) are long-lived in nature; that is, their lifetime need not be bounded by a polyno...
متن کاملResource-Bounded Local Computation
This paper proposes a generic approximation method for solving the problem of inference under limited computational resources. The method is based on the concept of valuation algebras with its wide range of possible instantiations in many different domains. The goal is to construct convenient resource-bounded anytime algorithms, for which the available time to perform the local computations is ...
متن کاملA New Approach for Stress State - Dependent Flow Localization Failure Bounded Through Ductile Damage in Dynamically Loaded Sheets
In this paper, a new approach is proposed for stress state - dependent flow localization in bifurcation failure model bounded through ductile damage in dynamically loaded sheets. Onset of localized necking is considered in phenomenological way for different strain rates to draw the forming limit diagram (FLD). Using a strain metal hardening exponent in the Vertex theory related to the strain ra...
متن کاملFrequency Computation and Bounded Queries
There have been several papers over the last ten years that consider the number of queries needed to compute a function as a measure of its complexity. The following function has been studied extensively in that light: Ft(xl,. . .,x0) = ,4(x,). .A(x,). We are interested in the complexity (in terms of the number of queries) of approximating Fi. Let b <a and let f be any function such that Ft(xl,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PLOS Computational Biology
سال: 2015
ISSN: 1553-7358
DOI: 10.1371/journal.pcbi.1004039